Find the smallest prime palindrome greater than or equal to N.
Recall that a number is prime if it's only divisors are 1 and itself, and it is greater than 1.
For example, 2,3,5,7,11 and 13 are primes.
Recall that a number is a palindrome if it reads the same from left to right as it does from right to left.
For example, 12321 is a palindrome.
Input: 6 Output: 7
Input: 8 Output: 11
Input: 13 Output: 101
1 <= N <= 10^8- The answer is guaranteed to exist and be less than
2 * 10^8.
implSolution{pubfnprime_palindrome(mutn:i32) -> i32{loop{match n {999 | 99_999 | 9_999_999 => n = n *10 + 11, n ifSelf::is_palindrome(n) && Self::is_prime(n) => return n, _ => n += 1,}}}fnis_palindrome(mutn:i32) -> bool{if n % 10 == 0{returnfalse;}letmut rev = 0;while n > rev { rev *= 10; rev += n % 10; n /= 10;} n == rev || n == rev / 10}fnis_prime(n:i32) -> bool{letmut i = 2;while i * i <= n && n % i != 0{ i += 1;} n > 1 && i * i > n }}